Evaluation of a coding design for a very noisy channel
نویسندگان
چکیده
منابع مشابه
Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems
Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...
متن کاملRobustness to channel variation in source coding for transmission across noisy channels
We consider the problem of lossy source coding for transmission across an unknown or time-varying noisy channel. The objective is to design an optimal compression system for applications where the unknown channel characteristics are independently estimated at the channel encoder and decoder. Channel estimation reliability is allowed to vary from perfect channel identi cation to no channel ident...
متن کاملRobust vector quantizer design by noisy channel relaxation
This letter proposes a method to design a vector quantizer (VQ) for robust performance under noisy channel conditions. By re-optimizing the quantizer at progressively lower levels of assumed channel noise, the design is less susceptible to poor local optima. The method is applied to: 1) channel-optimized VQ design; and 2) index assignment for a source-optimized VQ. For both problems, we demonst...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988